By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 13, Issue 1, pp. 1-217

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On the Existence of Cook Semantics

Arie de Bruin

pp. 1-13

BibTeX  Abstract Full Text:  PDF

Generalized Selection and Ranking: Sorted Matrices

Greg N. Frederickson and Donald B. Johnson

pp. 14-30

BibTeX  Abstract Full Text:  PDF

Linear Time Algorithms for Two- and Three-Variable Linear Programs

M. E. Dyer

pp. 31-45

BibTeX  Abstract Full Text:  PDF

On Synchronous Parallel Computations with Independent Probabilistic Choice

John H. Reif

pp. 46-56

BibTeX  Abstract Full Text:  PDF

Clique Covering of Graphs IV. Algorithms

Norman J. Pullman

pp. 57-75

BibTeX  Abstract Full Text:  PDF

Formal Systems for Tuple and Equality Generating Dependencies

C. Beeri and M. Y. Vardi

pp. 76-98

BibTeX  Abstract Full Text:  PDF

The Traveling Salesman Problem with Many Visits to Few Cities

Stavros S. Cosmadakis and Christos H. Papadimitriou

pp. 99-108

BibTeX  Abstract Full Text:  PDF

The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem

Udi Manber and Martin Tompa

pp. 109-115

BibTeX  Abstract Full Text:  PDF

Optimizing Chain Queries in a Distributed Database System

Dah-Ming Chiu, Philip A. Bernstein, and Yu-Chi Ho

pp. 116-134

BibTeX  Abstract Full Text:  PDF

Alternating Pushdown and Stack Automata

Richard E. Ladner, Richard J. Lipton, and Larry J. Stockmeyer

pp. 135-155

BibTeX  Abstract Full Text:  PDF

Limitations on Explicit Constructions of Expanding Graphs

Maria Klawe

pp. 156-166

BibTeX  Abstract Full Text:  PDF

Pushdown Permuter Characterization Theorem

Prakash V. Ramanan

pp. 167-169

BibTeX  Abstract Full Text:  PDF

Tighter Bounds for the Multifit Processor Scheduling Algorithm

Donald K. Friesen

pp. 170-181

BibTeX  Abstract Full Text:  PDF

On the Complexity of Some Common Geometric Location Problems

Nimrod Megiddo and Kenneth J. Supowit

pp. 182-196

BibTeX  Abstract Full Text:  PDF

Minimal-Cost Brother Trees

Thomas Ottmann, D. Stott Parker, Arnold L. Rosenberg, Hans W. Six, and Derick Wood

pp. 197-217

BibTeX  Abstract Full Text:  PDF